The Rough Riders

Return of the Night Riders

Namely-Riders: An Update

I here recall Ryle's analysis of Heterologicality, but broaden the discussion to comparable analyses not only of Heterologicality but also other puzzles about self-reference. Such matters have a crucial bearing on the debate between representational and non-representational theories of mind, as will be explained. 1 [1] The most remarkable thing about the so-called Heterologicality Paradox is th...

Local Monopsony and Free Riders

In an industry with upstream economies of scale in the distribution of differentiated products to retailers which have monopoly power within separate local market areas, the retailers have an incentive to exert monopsony power due to the divergence between average and marginal costs in the distribution of those inputs. The retailers increase their ability to exert monopsony power by forming coa...

T-Rough Sets Based on the Lattices

The aim of this paper is to introduce and study set- valued homomorphism on lattices and T-rough lattice with respect to a sublattice. This paper deals with T-rough set approach on the lattice theory. The result of this study contributes to, T-rough fuzzy set and approximation theory and proved in several papers. Keywords: approximation space; lattice; prime ideal; rough ideal; T-rough set; set...

Fast Algorithms for the Free Riders Problem in Broadcast Encryption

We provide algorithms to solve the free riders problem in broadcast encryption. In this problem, the broadcast server is allowed to choose some small subset F of the revoked set R of users to allow to decrypt the broadcast, despite having been revoked. This may allow the server to significantly reduce network traffic while only allowing a small set of non-privileged users to decrypt the broadca...